Parallel-recursive filter structures for the computation of discrete transforms
نویسندگان
چکیده
A general approach is presented for implementing discrete transforms as a set of rst-order or second-order recursive digital lters. Clenshaw's recurrence formulae are used to formulate the second-order lters. The resulting structure is suitable for e cient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration.
منابع مشابه
Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms
The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...
متن کاملBlock Time-Recursive Real-Valued Discrete Gabor Transform Implemented by Unified Parallel Lattice Structures
In this paper, the 1-D real-valued discrete Gabor transform (RDGT) proposed in our previous work and its relationship with the complex-valued discrete Gabor transform (CDGT) are briefly reviewed. Block time-recursive RDGT algorithms for the efficient and fast computation of the 1-D RDGT coefficients and for the fast reconstruction of the original signal from the coefficients are then developed ...
متن کاملA New Recursive Decomposition Algorithm for Realizing Fast IMDCT Computation
In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computati...
متن کاملHigh Speed Recursive Realisations of Small Length Dfts
This paper develops a prime radix transform algorithm that can be used to calculate the discrete Fourier transform (DFT) of a data block of length P, a prime, using fixed coefficient second order recursive filter sections: this simple hardware structure allows compact, high performance DFT processors to be developed. Further “massaging” of the prime radix algorithm produces the zero factor tran...
متن کاملFixing of Cycle Slips in Dual-Frequency GPS Phase Observables using Discrete Wavelet Transforms
The occurrence of cycle slips is a major limiting factor for achievement of sub-decimeter accuracy in positioning with GPS (Global Positioning System). In the past, several authors introduced a method based on different combinations of GPS data together with Kalman filter to solve the problem of the cycle slips. In this paper the same philosophy is used but with discrete wavelet transforms. For...
متن کامل